A Calculus for Higher Order Procedures with Global Variables
نویسندگان
چکیده
An arithmetically complete axiom system for full Algol-like higher order procedures with mode depth one is presented. To show soundness, a translation of the calculus into a variant of Dynamic Logic is deened. The completeness proof is outlined.
منابع مشابه
Predicate transformer semantics of a higher-order imperative language with record subtyping
Using a set-theoretic model of predicate transformers and ordered data types, we give a total-correctness semantics for a higher order imperative programming language that includes record extension, local variables, and procedure-type variables and parameters. The language includes infeasible speciication constructs, for a calculus of reenement. Procedures may have global variables, subject to ...
متن کاملThe calculus of constructions as a framework for proof search with set variable instantiation
We show how a procedure developed by Bledsoe for automatically nding substitution instances for set variables in higher-order logic can be adapted to provide increased automation in proof search in the Calculus of Constructions (CC). Bledsoe's procedure operates on an extension of rst-order logic that allows existential quantiication over set variables. The method nds maximal solutions for this...
متن کاملSLIDING MODE CONTROL BASED ON FRACTIONAL ORDER CALCULUS FOR DC-DC CONVERTERS
The aim of this paper is to design a Fractional Order Sliding Mode Controllers (FOSMC)for a class of DC-DC converters such as boost and buck converters. Firstly, the control lawis designed with respect to the properties of fractional calculus, the design yields an equiv-alent control term with an addition of discontinuous (attractive) control law. Secondly, themathematical proof of the stabilit...
متن کاملReasoning in Extensional Type Theory with Equality
We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compact representation of cut-free (ground) proofs as extensional expansion dags. Automated proof search can be realized using a few operations to manipulate extensional expansion dags with variables. These search operations form a b...
متن کاملRepresentation of Programming Constructs with the Kell-m Calculus
Kell-m is a new asynchronous, higher-order process calculus with localities, developed for modelling and verifying distributed event-based systems and applications. Although simple, due to the low level nature of kell-m, considerable effort is required when modelling complex systems. In this report we illustrate how common programming constructs such as variables, procedures, modules and lists ...
متن کامل